Computer languages

Results: 15814



#Item
31KS_JU@DPIL-FIRE2016:Detecting Paraphrases in Indian Languages Using Multinomial Logistic Regression Model Kamal Sarkar Department of Computer Science and Engineering Jadavpur University, Kolkata, India

KS_JU@DPIL-FIRE2016:Detecting Paraphrases in Indian Languages Using Multinomial Logistic Regression Model Kamal Sarkar Department of Computer Science and Engineering Jadavpur University, Kolkata, India

Add to Reading List

Source URL: ceur-ws.org

- Date: 2016-11-18 14:11:21
    32Clustering WordNet Word Senses Eneko Agirre and Oier Lopez de Lacalle* Department of computer languages and systems. University of the Basque Country. p.k. 649, 20080 Donostia. Spain. {eneko,jibloleo}@si.ehu.es

    Clustering WordNet Word Senses Eneko Agirre and Oier Lopez de Lacalle* Department of computer languages and systems. University of the Basque Country. p.k. 649, 20080 Donostia. Spain. {eneko,jibloleo}@si.ehu.es

    Add to Reading List

    Source URL: ixa.si.ehu.eus

    - Date: 2008-04-17 06:19:59
      33Domain-Specific Languages for Finance DSL Research in the H IPERFIT Research Center Jost Berthold Department of Computer Science University of Copenhagen

      Domain-Specific Languages for Finance DSL Research in the H IPERFIT Research Center Jost Berthold Department of Computer Science University of Copenhagen

      Add to Reading List

      Source URL: www.gsdp.eu

      - Date: 2011-11-01 10:32:29
        34On Nominal Regular Languages with Binders? Extended version Alexander Kurz, Tomoyuki Suzuki?? , and Emilio Tuosto Department of Computer Science, University of Leicester, UK  Abstract. We investigate regular languages on

        On Nominal Regular Languages with Binders? Extended version Alexander Kurz, Tomoyuki Suzuki?? , and Emilio Tuosto Department of Computer Science, University of Leicester, UK Abstract. We investigate regular languages on

        Add to Reading List

        Source URL: www.cs.le.ac.uk

        - Date: 2012-01-09 10:51:24
          35A Latent Variable Model of Synchronous Syntactic-Semantic Parsing for Multiple Languages Andrea Gesmundo Univ Geneva Dept Computer Sci

          A Latent Variable Model of Synchronous Syntactic-Semantic Parsing for Multiple Languages Andrea Gesmundo Univ Geneva Dept Computer Sci

          Add to Reading List

          Source URL: aclweb.org

          - Date: 2010-06-15 09:04:09
            36T A C  J D´ Department of Languages and Computer Systems Polytechnical University of Catalunya

            T A C  J D´ Department of Languages and Computer Systems Polytechnical University of Catalunya

            Add to Reading List

            Source URL: users.uoa.gr

            - Date: 2014-06-11 17:30:31
              37Minimal Partial Languages and Automata? F. Blanchet-Sadri1 , K. Goldner2 , and A. Shackleton3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170, USA

              Minimal Partial Languages and Automata? F. Blanchet-Sadri1 , K. Goldner2 , and A. Shackleton3 1 Department of Computer Science, University of North Carolina, P.O. Box 26170, Greensboro, NC 27402–6170, USA

              Add to Reading List

              Source URL: www.uncg.edu

              - Date: 2014-08-26 11:04:33
                38Automatic Construction of Morphologically Motivated Translation Models for Highly Inflected, Low-Resource Languages John Hewitt  Department of Computer and Information Science, University of Pennsy

                Automatic Construction of Morphologically Motivated Translation Models for Highly Inflected, Low-Resource Languages John Hewitt Department of Computer and Information Science, University of Pennsy

                Add to Reading List

                Source URL: www.seas.upenn.edu

                - Date: 2016-10-29 18:34:40
                  39Name Tagging for Low-resource Incident Languages based on Expectation-driven Learning Boliang Zhang1 , Xiaoman Pan1 , Tianlu Wang2 , Ashish Vaswani3 , Heng Ji1 , Kevin Knight3 , Daniel Marcu3 1 Computer Science Departmen

                  Name Tagging for Low-resource Incident Languages based on Expectation-driven Learning Boliang Zhang1 , Xiaoman Pan1 , Tianlu Wang2 , Ashish Vaswani3 , Heng Ji1 , Kevin Knight3 , Daniel Marcu3 1 Computer Science Departmen

                  Add to Reading List

                  Source URL: nlp.cs.rpi.edu

                  - Date: 2016-04-01 20:24:29
                    40Tight Bounds for Linkages in Planar Graphs. 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, Lecture Notes in Computer Science, Springer Verlag, 2011. Irrelevant Vertices for the Planar D

                    Tight Bounds for Linkages in Planar Graphs. 38th International Colloquium on Automata, Languages and Programming, ICALP 2011, Lecture Notes in Computer Science, Springer Verlag, 2011. Irrelevant Vertices for the Planar D

                    Add to Reading List

                    Source URL: users.uoa.gr

                    - Date: 2014-06-11 17:30:28